|
|
Using Metric Indexes For Effective and Efficient Multimedia Exploration
Čech, Přemysl ; Lokoč, Jakub (advisor) ; Skopal, Tomáš (referee)
The exponential growth of multimedia data challenges effectiveness and efficiency of the state-of-the- art retrieval techniques. In this thesis, we focus on browsing of large datasets using exploration approaches where query cannot be particularly expressed or where the need of some general notion of the dataset is required. More specifically, we study exploration scenarios utilizing the metric access method PM-Tree which natively creates a hierarchy of nested metric regions. We enhance the PM- Tree for the exploration purposes and define different traversing and querying strategies. Further, we investigate range multi-query (range query defined by multiple objects) approaches. We propose new effective and efficient cut-region range query and compare the new query with other approaches for efficient multi-query processing. Finally, we implemented all new methods and strategies for the PM- Tree into multimedia exploration framework and tested browsing algorithms on a game-like demo application.
|
|
|
Using Metric Indexes For Effective and Efficient Multimedia Exploration
Čech, Přemysl ; Lokoč, Jakub (advisor)
The exponential growth of multimedia data challenges effectiveness and efficiency of the state-of-the- art retrieval techniques. In this thesis, we focus on browsing of large datasets using exploration approaches where query cannot be particularly expressed or where the need of some general notion of the dataset is required. More specifically, we study exploration scenarios utilizing the metric access method PM-Tree which natively creates a hierarchy of nested metric regions. We enhance the PM- Tree for the exploration purposes and define different traversing and querying strategies. Further, we investigate range multi-query (range query defined by multiple objects) approaches. We propose new effective and efficient cut-region range query and compare the new query with other approaches for efficient multi-query processing. Finally, we implemented all new methods and strategies for the PM- Tree into multimedia exploration framework and tested browsing algorithms on a game-like demo application.
|
|
|
Using Metric Indexes For Effective and Efficient Multimedia Exploration
Čech, Přemysl ; Lokoč, Jakub (advisor)
The exponential growth of multimedia data challenges effectiveness and efficiency of the state-of-the- art retrieval techniques. In this thesis, we focus on browsing of large datasets using exploration approaches where query cannot be particularly expressed or where the need of some general notion of the dataset is required. More specifically, we study exploration scenarios utilizing the metric access method PM-Tree which natively creates a hierarchy of nested metric regions. We enhance the PM- Tree for the exploration purposes and define different traversing and querying strategies. Further, we investigate range multi-query (range query defined by multiple objects) approaches. We propose new effective and efficient cut-region range query and compare the new query with other approaches for efficient multi-query processing. Finally, we implemented all new methods and strategies for the PM- Tree into multimedia exploration framework and tested browsing algorithms on a game-like demo application.
|
|
|
Using Metric Indexes For Effective and Efficient Multimedia Exploration
Čech, Přemysl ; Lokoč, Jakub (advisor) ; Skopal, Tomáš (referee)
The exponential growth of multimedia data challenges effectiveness and efficiency of the state-of-the- art retrieval techniques. In this thesis, we focus on browsing of large datasets using exploration approaches where query cannot be particularly expressed or where the need of some general notion of the dataset is required. More specifically, we study exploration scenarios utilizing the metric access method PM-Tree which natively creates a hierarchy of nested metric regions. We enhance the PM- Tree for the exploration purposes and define different traversing and querying strategies. Further, we investigate range multi-query (range query defined by multiple objects) approaches. We propose new effective and efficient cut-region range query and compare the new query with other approaches for efficient multi-query processing. Finally, we implemented all new methods and strategies for the PM- Tree into multimedia exploration framework and tested browsing algorithms on a game-like demo application.
|
|
|
Nové dynamické metody konstrukce pro PM-strom
Čech, Přemysl ; Lokoč, Jakub (advisor) ; Pangrác, Ondřej (referee)
With the emerging applications dealing with complex multimedia retrieval, such as the multimedia exploration, appropriate indexing structures need to be designed. A formalism for compact metric region description can significantly simplify the design of algorithms for such indexes, thus more complex and efficient metric indexes can be developed. In this thesis, we introduce the cut-regions comprising compact metric region description and basic operations. To demonstrate their power, we redefine the PM-Tree using the cut-regions and, moreover, use the formalism to improve the PM-Tree construction techniques. We have experimentally evaluated that the improved construction techniques lead to query performance originally obtained just using expensive construction techniques. Also in comparison with other metric and spatial access methods, the revisited PM-Tree proved its benefits.
|
guest ::
